Syntax and semantics of the weak consistency model specification language cat
نویسندگان
چکیده
We provide the syntax and semantics of the cat language, a domain specific language to describe consistency properties of parallel/distributed programs. The language is implemented in the herd7 tool Alglave and Maranget (2015).
منابع مشابه
Syntax and analytic semantics of LISA
We provide the syntax and semantics of the lisa (for “Litmus Instruction Set Architecture”) language. The parallel assembly language lisa is implemented in the herd7 tool (Alglave and Maranget, 2015) for simulating weak consistency models.
متن کاملSemantic Rules of UML Specification
Abstract— Modeling of a system is an essential process in software development lifecycle (SDLC). It will produce a system artifact called a system model. In object– oriented based software development, a system model can be developed by using Unified Modeling Language (UML). UML is a modeling language for specifying, constructing, and documenting the artifacts of systems. It consists of 13 diag...
متن کاملStatic Analysis and Testing of Executable DSL Specification
In model-driven software engineering, the syntax of a modelling language is defined as a meta-model, and its semantics is defined by some other formal languages. As the languages for defining syntax and semantics comes from different technology space, maintaining the correctness and consistency of a language specification is a challenging topic. Technologies on formal methods or sophisticated d...
متن کاملProposal for Improving the UML Abstract Syntax
Different types of consistency of UML models have been described in the literature. The consistency of UML models with the UML static semantics, usually referred as wellformedness, and the consistency between different versions of the same model are among the most cited. The UML models’ well-formedness is a precondition for any other kind of consistency, being described by means of the UML abst...
متن کاملSPATIAL TYPES FOR CONCURRENCY A Spatial Logic to Specify and Verify Distributed Systems
The problem of specifying and verifying properties is considered to be a classical problem in Computer Science. Recently, there has been a growing interest in spatial properties of Distributed Systems. So, several models have been proposed such that the proof systems are, in general, undecidable. An exception is the model-checker of Luı́s Caires. Traditionally, type systems are used to guarantee...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1608.07531 شماره
صفحات -
تاریخ انتشار 2016